Fitting a graph to vector data Citation
نویسندگان
چکیده
We introduce a measure of how well a combinatorial graph fits a collection of vectors. The optimal graphs under this measure may be computed by solving convex quadratic programs and have many interesting properties. For vectors in d dimensional space, the graphs always have average degree at most 2(d+1), and for vectors in 2 dimensions they are always planar. We compute these graphs for many standard data sets and show that they can be used to obtain good solutions to classification, regression and clustering problems.
منابع مشابه
spa: A Semi-Supervised R Package for Semi-Parametric Graph-Based Estimation
In this paper, we present an R package that combines feature-based (X) data and graph-based (G) data for prediction of the response Y . In this particular case, Y is observed for a subset of the observations (labeled) and missing for the remainder (unlabeled). We examine an approach for fitting Ŷ = Xβ̂ + f̂(G) where β̂ is a coefficient vector and f̂ is a function over the vertices of the graph. The...
متن کاملVector Space semi-Cayley Graphs
The original aim of this paper is to construct a graph associated to a vector space. By inspiration of the classical definition for the Cayley graph related to a group we define Cayley graph of a vector space. The vector space Cayley graph ${rm Cay(mathcal{V},S)}$ is a graph with the vertex set the whole vectors of the vector space $mathcal{V}$ and two vectors $v_1,v_2$ join by an edge whenever...
متن کاملEmbedding graphs in Lorentzian spacetime
Geometric approaches to network analysis combine simply defined models with great descriptive power. In this work we provide a method for embedding directed acyclic graphs (DAG) into Minkowski spacetime using Multidimensional scaling (MDS). First we generalise the classical MDS algorithm, defined only for metrics with a Riemannian signature, to manifolds of any metric signature. We then use thi...
متن کاملHyperspectral Images Classification by Combination of Spatial Features Based on Local Surface Fitting and Spectral Features
Hyperspectral sensors are important tools in monitoring the phenomena of the Earth due to the acquisition of a large number of spectral bands. Hyperspectral image classification is one of the most important fields of hyperspectral data processing, and so far there have been many attempts to increase its accuracy. Spatial features are important due to their ability to increase classification acc...
متن کاملA Topical Graph Kernel for Link Prediction in Labeled Graphs
This paper proposes a solution to the problem of link prediction in labeled graphs with additional text information associated with the nodes. By fitting a topic model on the text corpus and some processing, we compute the topics of interest to a node. We propose a walk based graph kernel which incorporates the node’s interest and thus represents structural as well as textual information. We th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009